A Split-Decoding Message Passing Algorithm for Low Density Parity Check Decoders

نویسندگان

  • Tinoosh Mohsenin
  • Bevan M. Baas
چکیده

A Split decoding algorithm is proposed which divides each row of the parity check matrix into two or multiple nearly-independent simplified partitions. The proposed method significantly reduces the wire interconnect and decoder complexity and therefore results in fast, small, and high energy efficiency circuits. Three full-parallel decoder chips for a (2048, 1723) LDPC code compliant with the 10GBASE-T standard using MinSum normalized, MinSum Split-2, and MinSum Split-4 methods are designed in 65 nm, seven metal layer CMOS. The Split-4 decoder occupies 6.1 mm2, operates at 146 MHz, delivers 19.9 Gbps throughput, with 15 decoding iterations. At 0.79 V, it operates at 47 MHz, delivers 6.4 Gbps and dissipates 226 mW. Compared to MinSum normalized, the Split-4 decoder chip is 3.3 times smaller, has a clock rate and throughput 2.5 times higher, is 2.5 times more energy efficient, and has an error performance degradation of 0.55 dB with 15 iterations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Iterative Decoding Algorithms for Low-Density Parity-Check (LDPC) Codes

Low-Density Parity-Check (LDPC) codes have gained lots of popularity due to their capacity achieving/approaching property. This work studies the iterative decoding also known as message-passing algorithms applied to LDPC codes. Belief propagation (BP) algorithm and its approximations, most notably min-sum (MS), are popular iterative decoding algorithms used for LDPC and turbo codes. The thesis ...

متن کامل

Capacity Approaching Codes , Iterative Decoding Algorithms , and Their Applications

Implementation constraints on iterative decoders applying message-passing algorithms are investigated. Serial implementations similar to traditional microprocessor datapaths are compared against architectures with multiple processing elements that exploit the inherent parallelism in the decoding algorithm. Turbo codes and low-density parity check codes, in particular, are evaluated in terms of ...

متن کامل

Iterative Decoder Architectures

Implementation constraints imposed on iterative decoders applying message-passing algorithms are investigated. Serial implementations similar to traditional microprocessor datapaths are compared against architectures with multiple processing elements that exploit the inherent parallelism in the decoding algorithm. Turbo codes and low-density parity check codes, in particular, are evaluated in t...

متن کامل

On Turbo-Schedules for LDPC Decoding

The convergence rate of LDPC decoding is comparatively slower than turbo code decoding: 25 LDPC iterations versus 8-10 iterations for turbo codes. Recently, Mansour proposed a ‘turbo-schedule’ to improve the convergence rate of LDPC decoders. In this letter, we first extend the turbo-scheduling principle to the check messages. Second, we show analytically that the convergence rate of both turbo...

متن کامل

Codes on Graphs and Analysis of Iterative Algorithms for Reconstructing Sparse Signals and Decoding of Check-Hybrid GLDPC Codes

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 1. Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 1.1. Block Codes . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 1.1.1. Linear Block Codes . . . . . . . . . . . . . . . . . . 22 1.2. Commun...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Signal Processing Systems

دوره 61  شماره 

صفحات  -

تاریخ انتشار 2010